Quantum Fourier transform

Results: 86



#Item
61A Procedural Formalism for Quantum Computing ¨ Bernhard Omer 23th July 1998

A Procedural Formalism for Quantum Computing ¨ Bernhard Omer 23th July 1998

Add to Reading List

Source URL: tph.tuwien.ac.at

Language: English - Date: 2002-10-23 19:58:28
62Classical simulations of non-abelian quantum Fourier transforms Diploma Thesis Juan Bermejo Vega  December 7, 2011

Classical simulations of non-abelian quantum Fourier transforms Diploma Thesis Juan Bermejo Vega December 7, 2011

Add to Reading List

Source URL: www.mpq.mpg.de

Language: English - Date: 2014-06-01 09:02:23
63Bohr’s Inequality Steven Finch December 5, 2004 This essay complements an earlier one [1] on uncertainty inequalities. Let Bn,r denote the open n-dimensional ball of radius r centered at the origin. Assume that

Bohr’s Inequality Steven Finch December 5, 2004 This essay complements an earlier one [1] on uncertainty inequalities. Let Bn,r denote the open n-dimensional ball of radius r centered at the origin. Assume that

Add to Reading List

Source URL: www.people.fas.harvard.edu

Language: English - Date: 2005-01-24 10:36:08
64/asolve/website/ts/ts.dvi

/asolve/website/ts/ts.dvi

Add to Reading List

Source URL: www.people.fas.harvard.edu

Language: English - Date: 2008-08-20 09:05:18
65Uncertainty Inequalities  Steven Finch

Uncertainty Inequalities Steven Finch

Add to Reading List

Source URL: www.people.fas.harvard.edu

Language: English - Date: 2003-11-09 04:08:00
66[removed]Integrable systems: Yang-Baxter equation, Bethe ansatz, Yangian, Lax Pairs, Toda

[removed]Integrable systems: Yang-Baxter equation, Bethe ansatz, Yangian, Lax Pairs, Toda

Add to Reading List

Source URL: www.het.brown.edu

Language: English - Date: 2006-02-13 18:02:57
67Derivation of the Heisenberg Uncertainty Principle Andre Kessler April 13, 2010

Derivation of the Heisenberg Uncertainty Principle Andre Kessler April 13, 2010

Add to Reading List

Source URL: www.tjhsst.edu

Language: English - Date: 2010-04-13 19:02:15
68A Linear-Optical Proof that the Permanent is #P-Hard Scott Aaronson∗ For Les Valiant, on the occasion of his Turing Award

A Linear-Optical Proof that the Permanent is #P-Hard Scott Aaronson∗ For Les Valiant, on the occasion of his Turing Award

Add to Reading List

Source URL: www.scottaaronson.com

Language: English - Date: 2011-06-02 18:23:09
69The Temple of Quantum Computing  by Riley T. Perry

The Temple of Quantum Computing by Riley T. Perry

Add to Reading List

Source URL: www.mathcs.emory.edu

Language: English - Date: 2005-01-25 15:46:09
70Phase Estimation In this lecture we will describe Kitaev’s phase estimation algorithm, and use it to obtain an alternate derivation of a quantum factoring algorithm. We will also use this technique to design quantum circuits for computing the Quantum

Phase Estimation In this lecture we will describe Kitaev’s phase estimation algorithm, and use it to obtain an alternate derivation of a quantum factoring algorithm. We will also use this technique to design quantum circuits for computing the Quantum

Add to Reading List

Source URL: www.cs.berkeley.edu

Language: English - Date: 2009-04-21 15:51:01